771 research outputs found
Approval-Based Shortlisting
Shortlisting is the task of reducing a long list of alternatives to a
(smaller) set of best or most suitable alternatives from which a final winner
will be chosen. Shortlisting is often used in the nomination process of awards
or in recommender systems to display featured objects. In this paper, we
analyze shortlisting methods that are based on approval data, a common type of
preferences. Furthermore, we assume that the size of the shortlist, i.e., the
number of best or most suitable alternatives, is not fixed but determined by
the shortlisting method. We axiomatically analyze established and new
shortlisting methods and complement this analysis with an experimental
evaluation based on biased voters and noisy quality estimates. Our results lead
to recommendations which shortlisting methods to use, depending on the desired
properties
Potential Errors and Test Assessment in Software Product Line Engineering
Software product lines (SPL) are a method for the development of variant-rich
software systems. Compared to non-variable systems, testing SPLs is extensive
due to an increasingly amount of possible products. Different approaches exist
for testing SPLs, but there is less research for assessing the quality of these
tests by means of error detection capability. Such test assessment is based on
error injection into correct version of the system under test. However to our
knowledge, potential errors in SPL engineering have never been systematically
identified before. This article presents an overview over existing paradigms
for specifying software product lines and the errors that can occur during the
respective specification processes. For assessment of test quality, we leverage
mutation testing techniques to SPL engineering and implement the identified
errors as mutation operators. This allows us to run existing tests against
defective products for the purpose of test assessment. From the results, we
draw conclusions about the error-proneness of the surveyed SPL design paradigms
and how quality of SPL tests can be improved.Comment: In Proceedings MBT 2015, arXiv:1504.0192
Structure in Dichotomous Preferences
Many hard computational social choice problems are known to become tractable
when voters' preferences belong to a restricted domain, such as those of
single-peaked or single-crossing preferences. However, to date, all algorithmic
results of this type have been obtained for the setting where each voter's
preference list is a total order of candidates. The goal of this paper is to
extend this line of research to the setting where voters' preferences are
dichotomous, i.e., each voter approves a subset of candidates and disapproves
the remaining candidates. We propose several analogues of the notions of
single-peaked and single-crossing preferences for dichotomous profiles and
investigate the relationships among them. We then demonstrate that for some of
these notions the respective restricted domains admit efficient algorithms for
computationally hard approval-based multi-winner rules.Comment: A preliminary version appeared in the proceedings of IJCAI 2015, the
International Joint Conference on Artificial Intelligenc
- …